Erdos-Ko-Rado theorems for simplicial complexes
نویسنده
چکیده
A recent framework for generalizing the Erdős-KoRado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdős-Ko-Rado property for a graph in terms of the graph’s independent sets. Since the family of all independent sets of a graph forms a simplicial complex, it is natural to further generalize the Erdős-Ko-Rado property to an arbitrary simplicial complex. An advantage of working in simplicial complexes is the availability of algebraic shifting, a powerful shifting (compression) technique, which we use to verify a conjecture of Holroyd and Talbot in the case of sequentially Cohen-Macaulay near-cones.
منابع مشابه
Theorems of Erdos-Ko-Rado type in polar spaces
We consider Erdős-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erdős-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+ 1, q) with n ≥ 2.
متن کاملErdős-Ko-Rado Type Theorems for Simplicial Complexes
It is shown that every shifted simplicial complex ∆ is EKR of type (r, s), provided that the size of every facet of ∆ is at least (2s + 1)r − s. It is moreover proven that every i-near-cone simplicial complex is EKR of type (r, i) if depthK∆ > (2i + 1)r − i − 1, for some field K. Furthermore, we prove that if G is a graph having at least (2i + 1)r − i connected components, including i isolated ...
متن کاملIntersection Properties of Subsets of Integers
Intersection properties of sets have been widely investigated by many authors. One type of theorems proved for them has the following form [9]. Let S be an n-element set and AI. ... , AN £ S, 1 £ [1, n]. Assume that IAi I1Ajl E 1 for 1,,;;;; i <j ,,;;;;N. How large can N be under this condition, depending on n and I? Thus, e.g., the de Bruijn-Erdos theorem [1] asserts that if IAi I1Ajl = 1 for ...
متن کاملTowards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.
متن کاملIntersecting faces of a simplicial complex via algebraic shifting
A family A of sets is t-intersecting if the size of the intersection of every pair of sets in A is at least t, and it is an r-family if every set in A has size r. A wellknown theorem of Erdős, Ko, and Rado bounds the size of a t-intersecting r-family of subsets of an n-element set, or equivalently of (r−1)-dimensional faces of a simplex with n vertices. As a generalization of the Erdős-Ko-Rado ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011